Set cover problem - PDFSEARCH.IO - Document Search Engine

Set cover problem
Results: 76

#	Item
61	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics
62	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2006-04-11 06:21:40 NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory
63	Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-12-25 20:29:06 NP-complete problems Matching Combinatorial optimization Graph coloring Vertex cover Bipartite graph Adjacency matrix Independent set Shortest path problem Graph theory Mathematics Theoretical computer science
64	Problem Set 1. ESS 138 Remote Sensing. Due April 26th in lab. Choose 1 of 7 land cover types to ground truth in Southern California and identify your team, working with the T.A. Possible land cover types include 1) annua Add to Reading List Source URL: daac.ornl.gov Language: English - Date: 2013-12-17 16:41:23 EVI Moderate-Resolution Imaging Spectroradiometer Planetary science Microsoft Excel Latitude Subsetting Software Remote sensing Earth Normalized Difference Vegetation Index
65	Analysis of a Greedy Heuristic For Finding Small Dominating Sets in Graphs (To appear in Information Processing Letters) Abhay K. Parekh Laboratory For Information and Decision Systems, M.I.T., Cambridge, MA 02139, USA Add to Reading List Source URL: www.tecknowbasic.com Language: English - Date: 2005-07-07 00:58:29 Combinatorics Dominating set Set cover problem Greedy algorithm Mathematics Theoretical computer science NP-complete problems
66	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems NP-complete Set cover problem Vertex cover Approximation algorithm Greedy algorithm P versus NP problem NP Linear programming Theoretical computer science Computational complexity theory Mathematics
67	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
68	Chapter 1: An Introduction to Approximation Algorithms (cp. Williamson & Shmoys, Chapter 1) 4 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Mathematical optimization Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Vertex cover NP-complete Theoretical computer science Computational complexity theory Applied mathematics
69	Die Titel der Diskussionspapiere von Nr[removed]bis[removed]können bei Bedarf im Fachbereich Wirtschaftswissenschaft angefordert werden: FernUniversität, z Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-12-05 03:57:21 Mathematics Applied mathematics Combinatorial auction Reverse auction Mathematical optimization Set cover problem Covering problem Relaxation Auction Auction theory Auctioneering Business
70	Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗ Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2008-02-10 09:20:05 NP-complete problems Combinatorial optimization Maximum flow problem Graph coloring Cut Minimum k-cut Optimization problem Max-flow min-cut theorem Set cover problem Theoretical computer science Mathematics Graph theory

UPDATE